Reversible universal quantum computation within translation-invariant systems
نویسندگان
چکیده
منابع مشابه
Reversible universal quantum computation within translation invariant systems
We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantu...
متن کامل2 Reversible Quantum Computation
It has long been known that to minimise the heat emitted by a determin-istic computer during it's operation it is necessary to make the computation act in a logically reversible manner[Lan61]. Such logically reversible operations require a number of auxiliary bits to be stored, maintaining a history of the computation, and which allows the initial state to be reconstructed by running the comput...
متن کاملUniversal construction of order parameters for translation-invariant quantum lattice systems with symmetry-breaking order.
For any translation-invariant quantum lattice system with a symmetry group G, we propose a practical and universal construction of order parameters which identify quantum phase transitions with symmetry-breaking order. They are defined in terms of the fidelity between a ground state and its symmetry-transformed counterpart, and are computed through tensor network representations of the ground-s...
متن کاملQuantum cellular automaton for universal quantum computation
A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...
متن کاملUniversal computation by quantum walk.
In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2006
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.73.012324